OPTIMAL UCAV PATH PLANNING UNDER MISSILE THREATS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bat Algorithm with Mutation for UCAV Path Planning

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is propose...

متن کامل

A Modified Firefly Algorithm for UCAV Path Planning

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original firefly algorithm (FA) is used to solve the UCAV path planning problem. Furthermore, a new modified firefly algorithm (MFA) is prop...

متن کامل

Optimal path planning

This paper addresses the problem of optimizing the navigation of an intelligent mobile in a real world enviroanment described by a map The map is composed of features representing natural landmarks in the environment. The vehicle is equipped with a sensor which allows it to obtain range and bearing measurements from observed landmarks durinq the execution. These measurements are correlated with...

متن کامل

Sampling-based path planning: a new tool for missile guidance

A new missile midcourse guidance algorithm is proposed in this paper. It is a combination of sampling based path planning, Dubins’ curves and classical guidance laws. Moreover, a realistic interceptor missile model is used. It allows to anticipate the future changes of flight conditions along the trajectory, especially the loss of maneuverability at high altitude. Simulation results are present...

متن کامل

Discrete Optimal View Path Planning

This paper presents a discrete model of a sensor path planning problem, with a long-term planning horizon. The goal is to minimize the covariance of the reconstructed structures while meeting constraints on the length of the traversed path of the sensor. The sensor is restricted to move on a graph representing a discrete set of configurations, and additional constraints can be incorporated by a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC Proceedings Volumes

سال: 2005

ISSN: 1474-6670

DOI: 10.3182/20050703-6-cz-1902.02009